package 力扣_算法题综合;

public class 选择题常考的递归 {
    public static void main(String[] args) {
        System.out.println(ack(3,3));
    }
    private static int ack(int m, int n){
        if(m == 0){
            return n + 1;
        }else if(n == 0){
            return ack(m - 1,1);
        }else{
            return ack(m - 1,ack(m,n - 1));
        }
    }
}